An abstract model for parallel computations : Gandy's thesis
نویسندگان
چکیده
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملInterval linear regression
In this paper, we have studied the analysis an interval linear regression model for fuzzy data. In section one, we have introduced the concepts required in this thesis and then we illustrated linear regression fuzzy sets and some primary definitions. In section two, we have introduced various methods of interval linear regression analysis. In section three, we have implemented nu...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملOn the parallel computation thesis
We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures. We show that any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. The cells all run the same algorithm and communicate vi...
متن کاملDate Signature Address Dna Computation Chapter 3 Models of Dna Computation 21 Chapter 4 Implementation Issues 47 Chapter 7 Conclusions 107 Appendix a Laboratory Protocol 111 List of Figures
This is the rst ever doctoral thesis in the eld of DNA computation. The eld has its roots in the late 1950s, when the Nobel laureate Richard Feynman rst introduced the concept of computing at a molecular level. Feynman's visionary idea was only realised in 1994, when Leonard Adleman performed the rst ever truly molecular-level computation using DNA combined with the tools and techniques of mole...
متن کامل